منابع مشابه
A Fast Decision Tree Learning Algorithm
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast tree-growing algorithm without substantial decrease in accuracy and substantial increase in space complexity is essential. In this paper, we present a novel, fast decision-tree learning algorithm that is based on a con...
متن کاملExtremely Fast Decision Tree
We introduce a novel incremental decision tree learning algorithm, Hoeffding Anytime Tree, that is statistically more efficient than the current state-of-the-art, Hoeffding Tree. We demonstrate that an implementation of Hoeffding Anytime Tree—“Extremely Fast Decision Tree”, a minor modification to theMOA implementation of Hoeffding Tree—obtains significantly superior prequential accuracy onmost...
متن کاملEnergy Efficiency Analysis of the Very Fast Decision Tree Algorithm
Data mining algorithms are usually designed to optimize a trade-off between predictive accuracy and computational efficiency. This paper introduces energy consumption and energy efficiency as important factors to consider during data mining algorithm analysis and evaluation. We conducted an experiment to illustrate how energy consumption and accuracy are affected when varying the parameters of ...
متن کاملFast Algorithm for Stochastic Tree Computation
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which ‘macrostate’ and ‘microstate’ are used to simulate the growth unit and the metamers inside growth unit separately. Each state is characterized by its ‘physiological age’. The automaton is non-deterministic in case that ...
متن کاملGlobal Tree Optimization: A Non-greedy Decision Tree Algorithm
A non-greedy approach for constructing globally optimal multivariate decision trees with xed structure is proposed. Previous greedy tree construction algorithms are locally optimal in that they optimize some splitting criterion at each decision node, typically one node at a time. In contrast, global tree optimization explicitly considers all decisions in the tree concurrently. An iterative line...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Electrical and Computer Engineering
سال: 2014
ISSN: 1582-7445,1844-7600
DOI: 10.4316/aece.2014.01010